Steps Towards a Science of Heuristic Search

نویسنده

  • Christopher Makoto Wilt
چکیده

There are many algorithms designed to solve the shortest path problem. Each of the published algorithms has a demonstrated use; a situation in which it is the clear choice. Unfortunately, if faced with a novel problem, there is no reliable robust way to figure out which algorithm should be used to solve the new problem. When classifying things, the first step is to identify relevant features for classifications. In the context of heuristic search, it not clear what pieces of information should be used to predict search algorithm performance, and the question of algorithm selection for a novel domain is an open question. We first analyze which domain attributes common algorithms leverage, and discuss how to identify domains containing these attributes. In addition to discussing how to classify domains, we also discuss why the classifications matter for various algorithms. Ultimately, this will allow us to offer more accurate runtime predictions for various algorithms we analyze, allowing us to determine which algorithm will likely offer the best performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Steps towards a Science of Heuristic Search By

STEPS TOWARDS A SCIENCE OF HEURISTIC SEARCH by Christopher Makoto Wilt University of New Hampshire, May, 2014 Heuristic search is one of the most important graph search techniques, allowing people to find paths through graphs that can have more nodes than there are atoms in the universe. There has been much research in developing heuristic search algorithms, but much less work on when and why t...

متن کامل

A Monte Carlo-Based Search Strategy for Dimensionality Reduction in Performance Tuning Parameters

Redundant and irrelevant features in high dimensional data increase the complexity in underlying mathematical models. It is necessary to conduct pre-processing steps that search for the most relevant features in order to reduce the dimensionality of the data. This study made use of a meta-heuristic search approach which uses lightweight random simulations to balance between the exploitation of ...

متن کامل

A Novel Adapted Multi-objective Meta-heuristic Algorithm for a Flexible Bi-objective Scheduling Problem Based on Physics Theory

  We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evalua...

متن کامل

Extending the Applications of Recent Real-Time Heuristic Search

Real-time heuristic search algorithms that precompute search space-specific databases have demonstrated exceptional performance in video-game pathfinding. We discuss the first steps towards extending these algorithms to other search spaces that also benefit from the real-time property. We present our initial progress in characterizing the performance of current algorithms based on the features ...

متن کامل

Extending Applications of Recent Developments in Real-time Heuristic Search

Real-time heuristic search algorithms that precompute search space specific databases have demonstrated exceptional performance in video-game pathfinding. We discuss the first steps towards extending these algorithms to additional search spaces which benefit from the real-time property. We present our initial progress in characterizing the performance of current algorithms based on search space...

متن کامل

Few heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem

This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed intege...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013